#include <algorithm>
#include <cstdio>
using namespace std;
const int maxn = 1000;
int arr[maxn];
void quickSort(int l, int r)
{
    int pivot = arr[(l + r) / 2], i = l, j = r;
    do
    {
        while (i <= j && arr[i] < pivot)
            i++;
        while (i <= j && pivot < arr[j])
            j--;
        if (i <= j)
        {
            swap(arr[i], arr[j]);
            i++;
            j--;
        }
    } while (i <= j);
    if (l < j)
        quickSort(l, j);
    if (i < r)
        quickSort(i, r);
}
int main()
{
    for (int i = 0; i < 100; ++i)
        arr[i] = 100 - i;
    quickSort(0, 100);
    for (int i = 0; i < 100; ++i)
        printf("%d\t", arr[i]);
    return 0;
}